Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
نویسندگان
چکیده
منابع مشابه
Laplacian eigenvalues and partition problems in hypergraphs
We use the generalization of the Laplacian matrix to hypergraphs to obtain several spectral-like results on partition problems in hypergraphs which are computationally difficult to solve (NP-hard or NP-complete). Therefore it is very important to obtain nontrivial bounds. More precisely, the following parameters are bounded in the paper: bipartition width, averaged minimal cut, isoperimetric nu...
متن کاملGeneralized Laplacian Eigenvalues of Random Hypergraphs
This is a sequel to an accepted talk of WAW 2011, where we introduced a set of generalized Laplacians of hypergraphs through the high-ordered random walks. In that paper, we proved the eigenvalues of these Laplacians can effectively control the mixing rate of highordered random walks, the generalized distances/diameters, and the edge expansions. In this talk, we will give a preliminary report o...
متن کاملRegular Uniform Hypergraphs, s-Cycles, s-Paths and Their largest Laplacian H-Eigenvalues∗
In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected k-uniform hypergraph G, where k ≥ 3, reaches its upper bound 2∆(G), where ∆(G) is the largest degree of G, if and only if G is regular. Thus the largest Laplacian H-eigenvalue of G, reaches the same upper bound, if and only if G is regular and oddbipartite. We show that an s-cycle G, as a k-uniform hypergraph...
متن کاملEigenvalues and Quasirandom Hypergraphs
Let p(k) denote the partition function of k. For each k ≥ 2, we describe a list of p(k) − 1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous notions on hypergraph quasirandomness, beginning with the early work of Chung and Graham and Frankl-Rödl related to strong hypergraph regularity, the spectral approach of Friedman-Wigderson, and more recent results of...
متن کاملEigenvalues and Linear Quasirandom Hypergraphs
Let p(k) denote the partition function of k. For each k > 2, we describe a list of p(k) − 1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness by Kohayakawa, Rödl, and Skokan, and by Conlon, Hàn, Person, and Schacht, and the spectral approach of Friedman and Wigderson. For each of the quasirandom properties that i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.08.028